SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
نویسندگان
چکیده
Gossip-based protocols have received considerable attention for broadcast applications due to their attractive scalability and reliability properties. The reliability of probabilistic gossip schemes studied so far depends on each user having knowledge of the global membership and choosing gossip targets uniformly at random. The requirement of global knowledge is undesirable in largescale distributed systems. In this paper, we present a novel peer-to-peer membership service which operates in a completely decentralized manner in that nobody has global knowledge of membership. However, membership information is replicated robustly enough to support gossip with high reliability. Our scheme is completely self-organizing in the sense that the size of local views naturally converges to the ‘right’ value for gossip to succeed. This ‘right’ value is a function of system size, but is achieved without any node having to know the system size. We present the design, theoretical analysis and preliminary evaluation of SCAMP. Simulations show that its performance is comparable to that of previous schemes which use global knowledge of membership at each node.
منابع مشابه
Peer-to-Peer Membership Management for Gossip-Based Protocols
Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. The requirement of global knowledge impairs their applicability to very large-scale groups. In this paper, we pres...
متن کاملChurn Resilience of Peer-to-Peer Group Membership: A Performance Analysis
It is a well-known fact that the partition is one of the main problems in p2p group membership. This problem rises when failures and dynamics of peer participation, or churn, occur in the overlay topology created by a group membership protocol connecting the group of peers. Solutions based on Gossip-based Group Membership (GGM) cope well with the failures while suffer from network dynamics. Thi...
متن کاملGroup Membership for Peer-to-Peer Communication
This paper studies the problem of maintaining eventual consistent group membership without any synchrony assumption inside an unbounded group G of processes that varies over the time (processes may join and leave the group). Eventual consistency means that if at any time all group membership changes cease, processes will converge in a finite time to a single consistent view. Due to the lack of ...
متن کاملDistributed Algorithms and Educational Simulation/Visualisation in Collaborative Environments
This thesis examines a general class of applications called collaborative environments which allow in real-time multiple users to share and modify information in spite of not being present at the same physical location. Two views on collaborative environments have been taken by examining algorithms supporting the implementation of collaborative environments as well as using collaboration to sup...
متن کاملScalable Application-Level Anycast for Highly Dynamic Groups
We present an application-level implementation of anycast for highly dynamic groups. The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message. Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightwei...
متن کامل